A Maximum Cardinality Cut Algorithm for Co-bipartite and Split Graphs Using Bimodular Decomposition
نویسندگان
چکیده
The maximum cardinality cut (MaxCut) problem remains NP-complete for co-bipartite graphs and
 split graphs. Based on modular decomposition, in [3] it is shown that MaxCut polynomial-time solvable are factorable to bounded treewidth However, this approach fails because the modules of a graph exactly twins and connected components. In work we extend result using concept bimodules bimodular decomposition proposed [6]. Namely, show thatMaxCut can be factored decomposition.
منابع مشابه
The Maximum Cut Problem in Co-bipartite Chain Graphs
A co-bipartite chain graph is a co-bipartite graph in which the neighborhoods of the vertices in each clique can be linearly ordered with respect to inclusion. It is known that the maximum cut problem (MaxCut) is NP-hard in co-bipartite graphs [3]. We consider MaxCut in co-bipartite chain graphs. We first consider the twin-free case and present an explicit solution. We then show that MaxCut is ...
متن کاملGPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs
We design, implement, and evaluate GPU-based algorithms for the maximum cardinality matching problem in bipartite graphs. Such algorithms have a variety of applications in computer science, scientific computing, bioinformatics, and other areas. To the best of our knowledge, ours is the first study which focuses on GPU implementation of the maximum cardinality matching algorithms. We compare the...
متن کاملA scaling algorithm for maximum weight matching in bipartite graphs
Given a weighted bipartite graph, the maximum weight matching (MWM) problem is to find a set of vertex-disjoint edges with maximum weight. We present a new scaling algorithm that runs in O(m √ n logN) time, when the weights are integers within the range of [0, N ]. The result improves the previous bounds of O(Nm √ n) by Gabow and O(m √ n log (nN)) by Gabow and Tarjan over 20 years ago. Our impr...
متن کاملLinear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs
Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph problems. For general m-edge and n-vertex graphs, it is well-known to be solvable in O(m √ n) time. We develop the first linear-time algorithm to find maximumcardinality matchings on cocomparability graphs, a prominent subclass of perfect graphs that contains interval graphs as well as permutati...
متن کاملA branch-and-cut algorithm for the maximum cardinality stable set problem
We propose a branch-and-cut algorithm for the Maximum Cardinality Stable Set problem. Rank constraints of general structure are generated by executing clique separation algorithms on a modi4ed graph obtained with edge projections. A branching scheme exploiting the available inequalities is also introduced. A computational experience on the DIMACS benchmark graphs validates the e8ectiveness of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Turkish journal of mathematics & computer science
سال: 2021
ISSN: ['2148-1830']
DOI: https://doi.org/10.47000/tjmcs.748563